Best possible bounds for the weighted path length of optimum binary search trees
نویسنده
چکیده
We derive upper and lower bounds for the weighted path length P opt of optimum binary search trees. In particular, I/Iog3 H S Popt ~ 2 + H where H is the entropy of the frequency distribution. We also present an approximation algorithm which constructs nearly optimal trees.
منابع مشابه
A Best Possible Bound for the Weighted Path Length of Binary Search Trees
The weighted path length of optimum binary search trees is bounded above by Y'./3i + 2 a. + H where H is the entropy of the frequency distribution, /3i is the total weight of the internal nodes, and aj is the total weight of the leaves. This bound is best possible. A linear time algorithm for constructing nearly optimal trees is described. One of the popular methods for retrieving information b...
متن کاملExtremal Weighted Path Lengths in Random Binary Search Trees
We consider weighted path lengths to the extremal leaves in a random binary search tree. When linearly scaled, the weighted path length to the minimal label has Dickman’s infinitely divisible distribution as a limit. By contrast, the weighted path length to the maximal label needs to be centered and scaled to converge to a standard normal variate in distribution. The exercise shows that path le...
متن کاملTight Upper and Lower Bounds on the Path Length of Binary Trees
The external path length of a tree T is the sum of the lengths of the paths from the root to each external node. The maximal path length diierence, , is the diierence between the length of the longest and shortest such path. We prove tight lower and upper bounds on the external path length of binary trees with N external nodes and prescribed maximal path length diierence. In particular, we give...
متن کاملISA[ k ] Trees: a Class of Binary Search Trees with Minimal or Near Minimal Internal Path Length
In recent years several authors have investigated binary search trees with minimal internal path length. In this paper we propose relaxing the requirement of inserting all nodes on one level before going to the next level. This leads to a new class of binary search trees called ISA[k] trees. We investigated the average locate cost per node, average shift cost per node, total insertion cost, and...
متن کاملCapacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1975